SAT and SMT-Based Verification of Security Protocols Including Time Aspects

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Security Protocols

ing nonces by constants, an unbounded execution of the NeedhamSchroeder protocol can be represented by the following set CNS of clauses: ⇒ I(enca(〈na, a〉, pub(i))) I(enca(〈x, a〉, pub(b))) ⇒ I(enca(〈x, nb〉, pub(a))) I(enca(〈na, y〉, pub(a))) ⇒ I(enca(y, pub(i))) For simplicity, we have only described the clauses corresponding to the case where A starts sessions with a corrupted agent I and B is w...

متن کامل

automatic verification of authentication protocols using genetic programming

implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...

15 صفحه اول

SAT-based Verification of Data-Independent Access Control Security Systems

The Harrison-Ruzzo-Ullman problem is the verification of a set of policy rules, starting from an initial protection matrix, for the reachability of a state in which a generic access right is granted. Three decades ago, it was shown to be undecidable; however, recently Kleiner and Newcomb (KN) used communicating sequential processes to prove that the model checking of data-independent security s...

متن کامل

Generic Verification of Security Protocols

Security protocols are notoriously difficult to debug. One approach to the automatic verification of security protocols with a bounded set of agents uses logic programming with analysis and synthesis rules to describe how the attacker gains information and constructs new messages. We propose a generic approach to verifying security protocols in Spin. The dynamic process creation mechanism of Sp...

متن کامل

Diagrammatic Verification of Security Protocols

The Actor Specification Diagram Language is a rigorously defined graphical specification language, with features for modelling concurrency and asynchronous communication. These features make the language appropriate for the formal analysis of distributed security protocols. The graphical nature of the language makes protocol descriptions easy to read and understand, vital properties for appeal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sensors

سال: 2021

ISSN: 1424-8220

DOI: 10.3390/s21093055